package com.gupao.alg.alg100;

import java.util.List;

public class Topic3_2_102_Level_Travel_Element {


    public static void main(String[] args) {
        BinaryTree bTree = new BinaryTree();
        bTree.root = bTree.buildTreeByArray();
        int testMethod = 3;
        List<Integer> res = null;
        List<Double> res2 = null;
        switch (testMethod) {
            case 1://LeetCode 515 在每个树行中找最大值
                res = largestValues(bTree.root);
                System.out.println(res);
                break;
            case 2://LeetCode 637 在每个树行中找平均值
                res2 = averageOfLevels(bTree.root);
                System.out.println(res2);
                break;
            case 3://LeetCode 199 二叉树的右视图
                res = rightSideView(bTree.root);
                System.out.println(res);
                break;

        }

    }

    /**
     * LeetCode 515 在每个树行中找最大值
     *
     * @param root
     * @return
     */
    public static List<Integer> largestValues(TreeNode root) {
        return null;
    }

    /**
     * LeetCode 637 在每个树行中找平均值
     *
     * @param root
     * @return
     */
    public static List<Double> averageOfLevels(TreeNode root) {
        return null;
    }

    /**
     * LeetCode 199 二叉树的右视图
     *
     * @param root
     * @return
     */
    public static List<Integer> rightSideView(TreeNode root) {
        return null;
    }
}

